A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations

In this paper we propose a new lower bound for the resource constrained project scheduling problem with generalized precedence relationships. The lower bound is based on a relaxation of the resource constraints among independent activities and on a solution of the relaxed problem suitably represented by means of an AON acyclic network. Computational results are presented and confirmed a better practical performance of the proposed method with respect to the those present in the literature.